An Improved Taylor Algorithm for Computing the Matrix Logarithm

نویسندگان

چکیده

The most popular method for computing the matrix logarithm is a combination of inverse scaling and squaring in conjunction with Padé approximation, sometimes accompanied by Schur decomposition. In this work, we present Taylor series algorithm, based on free-transformation approach technique, that uses recent polynomial formulas evaluating approximation more efficiently than Paterson–Stockmeyer method. Two MATLAB implementations related to relative forward or backward error analysis, were developed compared different state-of-the art functions. Numerical tests showed new are generally accurate previously available codes, an intermediate execution time among all codes comparison.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved Thomas Algorithm for finite element matrix parallel computing

With the expansion of the scale of linear finite element analyzing data, efficiency of computation is a main technical bottleneck. For solving the bottleneck, parallel computation is playing an increasingly prominent role. At present, the researches on linear finite element parallel computation are mainly concentrated on the preprocessing phase, and goal of these researches is to reduce the com...

متن کامل

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

A fixed point iteration for computing the matrix logarithm

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Conver...

متن کامل

Improved Inverse Scaling and Squaring Algorithms for the Matrix Logarithm

A popular method for computing the matrix logarithm is the inverse scaling and squaring method, which essentially carries out the steps of the scaling and squaring method for the matrix exponential in reverse order. Here we make several improvements to the method, putting its development on a par with our recent version [SIAM J. Matrix Anal. Appl., 31 (2009), pp. 970–989] of the scaling and squ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9172018